Minimal pairs, inertia degrees, ramification degrees and implicit constant fields
نویسندگان
چکیده
An extension (K(X)|K, v) of valued fields is said to be valuation transcendental if we have equality in the Abhyankar inequality. Minimal pairs definition are fundamental objects investigation extensions. In this article, associate a uniquely determined positive integer with extension. This defined via chosen minimal pair definition, but it later shown independent choice. Further, show that encodes important information regarding implicit constant field v).
منابع مشابه
Constructing Minimal Pairs of Degrees
We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumer-ation reducibility. Relativized versions of this result are presented as well. 1. Introduction In the present paper we consider four kinds of reducibilities among sets of natural numbers: Tur...
متن کاملBounding and nonbounding minimal pairs in the enumeration degrees
We show that every nonzero ∆ 2 e-degree bounds a minimal pair. On the other hand, there exist Σ 2 e-degrees which bound no minimal pair.
متن کاملDegrees which do not bound minimal degrees
The high/low hierarchy respects the ordering of degrees, and so we can expect to find properties of order which are possessed by all degrees in a given hierarchy class. Such properties can also be found for classes of the generalized high/low hierarchy even though that hierarchy does not respect the ordering of the degrees. For example, Jockusch and Posner [4], extending a result of Cooper [l],...
متن کامل1-Generic Degrees Bounding Minimal Degrees Revisited
We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.
متن کاملOn minimal wtt-degrees and computably enumerable Turing degrees
Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2022
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2022.2078833